Graph-based Image Classification by Weighting Scheme

نویسندگان

  • Chuntao Jiang
  • Frans Coenen
چکیده

Image classification is usually accomplished using primitive features such as colour, shape and texture as feature vectors. Such vector model based classification has one large defect: it only deals with numerical features without considering the structural information within each image (e.g. attributes of objects, and relations between objects within one image). By including this sort of structural information, it is suggested that image classification accuracy can be improved. In this paper we introduce a framework for graph-based image classification using a weighting scheme. The schema was tested on a synthesized image dataset using different classification techniques. The experiments show that the proposed framework gives significantly better results than graph-based image classification in which no weighting is imposed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Scheme for Improving Accuracy of KNN Classification Algorithm Based on the New Weighting Technique and Stepwise Feature Selection

K nearest neighbor algorithm is one of the most frequently used techniques in data mining for its integrity and performance. Though the KNN algorithm is highly effective in many cases, it has some essential deficiencies, which affects the classification accuracy of the algorithm. First, the effectiveness of the algorithm is affected by redundant and irrelevant features. Furthermore, this algori...

متن کامل

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

متن کامل

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

Image Retrieval Using Dynamic Weighting of Compressed High Level Features Framework with LER Matrix

In this article, a fabulous method for database retrieval is proposed.  The multi-resolution modified wavelet transform for each of image is computed and the standard deviation and average are utilized as the textural features. Then, the proposed modified bit-based color histogram and edge detectors were utilized to define the high level features. A feedback-based dynamic weighting of shap...

متن کامل

A Multi Objective Graph Based Model for Analyzing Survivability of Vulnerable Networks

In the various fields of disaster management, choosing the best location for the Emergency Support & Supply Service Centers (ESSSCs) and the survivability of the network that provides the links between ESSSCs and their environment has a great role to be paid enough attention. This paper introduces a graph based model to measure the survivability of the linking's network. By values computed for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008